Preconditioned techniques for solving large sparse linear systems arising from the discretization of the elliptic partial differential equations

نویسندگان

  • Seyedeh Mahboubeh Molavi-Arabshahi
  • Mehdi Dehghan
چکیده

In this paper, we use the BiCG, BiCGSTAB methods as preconditioned techniques. Also we compare the preconditioned Krylov subspace methods such as GMRES, GMRES(m), QMR, BiCG, CGS, BiCGSTAB for solving linear systems arising from a class of fourth-order approximations for solving the elliptic partial differential equation Auxx + Buyy = f(x,y,u,ux,uy), where A and B are constants. Numerical results are given to show the efficiency of the proposed preconditioned BiCGSTAB method. 2006 Elsevier Inc. All rights reserved.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Solving large systems arising from fractional models by preconditioned methods

This study develops and analyzes preconditioned Krylov subspace methods to solve linear systems arising from discretization of the time-independent space-fractional models. First, we apply shifted Grunwald formulas to obtain a stable finite difference approximation to fractional advection-diffusion equations. Then, we employee two preconditioned iterative methods, namely, the preconditioned gen...

متن کامل

New variants of the global Krylov type methods for linear systems with multiple right-hand sides arising in elliptic PDEs

In this paper, we present new variants of global bi-conjugate gradient (Gl-BiCG) and global bi-conjugate residual (Gl-BiCR) methods for solving nonsymmetric linear systems with multiple right-hand sides. These methods are based on global oblique projections of the initial residual onto a matrix Krylov subspace. It is shown that these new algorithms converge faster and more smoothly than the Gl-...

متن کامل

Preconditioned Generalized Minimal Residual Method for Solving Fractional Advection-Diffusion Equation

Introduction Fractional differential equations (FDEs)  have  attracted much attention and have been widely used in the fields of finance, physics, image processing, and biology, etc. It is not always possible to find an analytical solution for such equations. The approximate solution or numerical scheme  may be a good approach, particularly, the schemes in numerical linear algebra for solving ...

متن کامل

A Generalized Conjugate Gradient Method for the Numerical Solution of Elliptic Partial Differential Equations

We consider a generalized conjugate gradient method for solving sparse, symmetric, positive-definite systems of linear equations, principally those arising from the discretization of boundary value problems for elliptic partial differential equations. The method is based on splitting off from the original coefficient matrix a symmetric, positive-definiteonethat corresponds to a more easily solv...

متن کامل

Supercomputers Toward Efficient Implementation of Preconditioned Conjugate Gradient Methods On Vector

We consider large, sparse linear systems that result from the discretization of partial differential equations on regular and irregular domains, and we focus on the application of the preconditioned conjugate

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Applied Mathematics and Computation

دوره 188  شماره 

صفحات  -

تاریخ انتشار 2007